Robustly Stable Multivariate Polynomials
نویسندگان
چکیده
We consider stability and robust stability of polynomials with respect to a given arbitrary disjoint decomposition C n = Γ⊎Λ. The polynomial is called stable if it has no zeros in the region of instability Λ and robustly stable if it is stable and remains so under small variations of its coefficients. Inspired by the article Robust stability of multivariate polynomials. Part 1: Small coefficient perturbations by V. L. Kharitonov and J. A. Torres-Muñoz (Multidimens. Systems Signal Process., 10(1):21– 32, 1999), we generalise some of their results to arbitrary stability decompositions and develop some fundamental results on robustly stable polynomials. Among them is a characterisation of robust stability in terms of the stability of several other polynomials, which yields a test for robust stability based on stability tests. Finally, we consider the special situation that the region of instability is a Cartesian product and recover some results for the special situations of linear partial differential resp. difference equation with constant coefficients.
منابع مشابه
Multivariate Stable Polynomials: Theory and Applications
Univariate polynomials with only real roots, while special, do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and Petter Brändén, a very successful multivariate generalization of this method has been developed. The first part of this paper surveys some of the main results of ...
متن کاملFast, exact and stable reconstruction of multivariate algebraic polynomials in Chebyshev form
We describe a fast method for the evaluation of an arbitrary high-dimensional multivariate algebraic polynomial in Chebyshev form at the nodes of an arbitrary rank-1 Chebyshev lattice. Our main focus is on conditions on rank-1 Chebyshev lattices allowing for the exact reconstruction of such polynomials from samples along such lattices and we present an algorithm for constructing suitable rank-1...
متن کاملStable multivariate Eulerian polynomials and generalized Stirling permutations
We study Eulerian polynomials as the generating polynomials of the descent statistic over Stirling permutations – a class of restricted multiset permutations. We develop their multivariate refinements by indexing variables by the values at the descent tops, rather than the position where they appear. We prove that the obtained multivariate polynomials are stable, in the sense that they do not v...
متن کاملLinks Between Robust and Quadratic Stability
An uncertain polynomial is robustly stable, or stable in the sense of Kharitonov, if it is stable for any admissible value of the uncertainty, provided the uncertainty is not varying. The same polynomial is quadratically stable, or stable in the sense of Lyapunov, if it is stable for any admissible value of the uncertainty, regardless of whether the uncertainty is varying or not. In this paper,...
متن کاملCoercive polynomials: Stability, order of growth, and Newton polytopes
In this article we introduce a stability concept for the coercivity of multivariate polynomials f ∈ R[x]. In particular, we consider perturbations of f by polynomials up to the so-called degree of stable coercivity, and we analyze this stability concept in terms of the corresponding Newton polytopes at infinity. For coercive polynomials f ∈ R[x] we also introduce the order of coercivity as a me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010